Reverse k-Nearest Neighbor Query Processing Method for Continuous Query Processing in Bigdata Environments
نویسندگان
چکیده
منابع مشابه
Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data
Given a query object q, a reverse nearest neighbor (RNN) query in a common certain database returns the objects having q as their nearest neighbor. A new challenge for databases is dealing with uncertain objects. In this paper we consider probabilistic reverse nearest neighbor (PRNN) queries, which return the uncertain objects having the query object as nearest neighbor with a sufficiently high...
متن کاملMultiple k Nearest Neighbor Query Processing in Spatial Network Databases
This paper concerns the efficient processing of multiple k nearest neighbor queries in a road-network setting. The assumed setting covers a range of scenarios such as the one where a large population of mobile service users that are constrained to a road network issue nearest-neighbor queries for points of interest that are accessible via the road network. Given multiple k nearest neighbor quer...
متن کاملA Review of various k-Nearest Neighbor Query Processing Techniques
Identifying the queried object, from a large volume of given uncertain dataset, is a tedious task which involves time complexity and computational complexity. To solve these complexities, various research techniques were proposed. Among these, the simple, highly efficient and effective technique is, finding the K-Nearest Neighbor (kNN) algorithm. It is a technique which has applications in vari...
متن کاملOn Processing of Continuous Bichromatic Reverse k-Nearest-Neighbor Queries
Bichromatic Reverse k-Nearest-Neighbor (BRkNN) query is a variant of the Reverse k-Nearest-Neighbor (RkNN) query that involves a set of service sites (e.g. gas stations) and a set of customer points (e.g. vehicles). It has many applications in Location-Based Services, in particular in mobile advertising. This paper investigates the processing of continuous BRkNN (CBRkNN) queries where the point...
متن کاملReverse k Nearest Neighbors Query Processing: Experiments and Analysis
Given a set of users, a set of facilities and a query facility q, a reverse k nearest neighbors (RkNN) query returns every user u for which the query is one of its k closest facilities. RkNN queries have been extensively studied under a variety of settings and many sophisticated algorithms have been proposed to answer these queries. However, the existing experimental studies suffer from a few l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korea Contents Association
سال: 2014
ISSN: 1598-4877
DOI: 10.5392/jkca.2014.14.10.454